Quasi-Optimal Elimination Trees for 2D Grids with Singularities
نویسندگان
چکیده
1 Jagiellonian University, 31007 Krakow, Poland 2AGH University of Science and Technology, 30059 Krakow, Poland 3Applied Mathematics & Computational Science, King Abdullah University of Science and Technology (KAUST), Thuwal 23955-6900, Saudi Arabia 4Earth Science & Engineering and Center for Numerical PorousMedia, King Abdullah University of Science and Technology (KAUST), Thuwal 23955-6900, Saudi Arabia 5Institute for Computational Engineering and Science, University of Texas, Austin, TX 78712-1229, USA
منابع مشابه
Optimal-order Nonnested Multigrid Methods for Solving Finite Element Equations Ii: on Non-quasi-uniform Meshes
Nonnested multigrid methods are proved to be optimal-order solvers for finite element equations arising from elliptic problems in the presence of singularities caused by re-entrant corners and abrupt changes in the boundary conditions, where the multilevel grids are appropriately refined near singularities and are not necessarily nested. Therefore, optimal and realistic finer grids (compared wi...
متن کاملHybrid Direct and Iterative Solver with Library of Multi-criteria Optimal Orderings for h Adaptive Finite Element Method Computations
In this paper we present a multi-criteria optimization of element partition trees and resulting orderings for multi-frontal solver algorithms executed for two dimensional h adaptive finite element method. In particular, the problem of optimal ordering of elimination of rows in the sparse matrices resulting from adaptive finite element method computations is reduced to the problem of finding of ...
متن کاملOptimal Self-healing of Smart Distribution Grids Based on Spanning Trees to Improve System Reliability
In this paper, a self-healing approach for smart distribution network is presented based on Graph theory and cut sets. In the proposed Graph theory based approach, the upstream grid and all the existing microgrids are modeled as a common node after fault occurrence. Thereafter, the maneuvering lines which are in the cut sets are selected as the recovery path for alternatives networks by making ...
متن کاملHybrid direct and iterative solvers for h refined grids with singularities
This paper describes a hybrid direct and iterative solver for two and three dimensional h adaptive grids with point singularities. The point singularities are eliminated by using a sequential linear computational cost solver O(N) on CPU [1]. The remaining Schur complements are submitted to incomplete LU preconditioned conjugated gradient (ILUPCG) iterative solver. The approach is compared to th...
متن کاملGraph Grammar based Multi-thread Multi-frontal Direct Solver with Galois Scheduler
In this paper, we present a multi-frontal solver algorithm for the adaptive finite element method expressed by graph grammar productions. The graph grammar productions construct first the binary elimination tree, and then process frontal matrices stored in distributed manner in nodes of the elimination tree. The solver is specialized for a class of one, two and three dimensional h refined meshe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Scientific Programming
دوره 2015 شماره
صفحات -
تاریخ انتشار 2015